A Tail Bound for Read-k Families of Functions
نویسندگان
چکیده
We prove a Chernoff-like large deviation bound on the sum of non-independent random variables that have the following dependence structure. The variables Y1, . . . , Yr are arbitrary Boolean functions of independent random variables X1, . . . , Xm, modulo a restriction that every Xi influences at most k of the variables Y1, . . . , Yr.
منابع مشابه
Starlike Functions of order α With Respect To 2(j,k)-Symmetric Conjugate Points
In this paper, we introduced and investigated starlike and convex functions of order α with respect to 2(j,k)-symmetric conjugate points and coefficient inequality for function belonging to these classes are provided . Also we obtain some convolution condition for functions belonging to this class.
متن کاملHigher order close-to-convex functions associated with Attiya-Srivastava operator
In this paper, we introduce a new class$T_{k}^{s,a}[A,B,alpha ,beta ]$ of analytic functions by using a newly defined convolution operator. This class contains many known classes of analytic and univalent functions as special cases. We derived some interesting results including inclusion relationships, a radius problem and sharp coefficient bound for this class.
متن کاملA numerical approach to solve eighth order boundary value problems by Haar wavelet collocation method
In this paper a robust and accurate algorithm based on Haar wavelet collocation method (HWCM) is proposed for solving eighth order boundary value problems. We used the Haar direct method for calculating multiple integrals of Haar functions. To illustrate the efficiency and accuracy of the concerned method, few examples are considered which arise in the mathematical modeling of fluid dynamics an...
متن کاملCold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution
In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 19 شماره
صفحات -
تاریخ انتشار 2012